Remarks on s-Extremal Codes
نویسنده
چکیده
We study s-extremal codes over F4 or over F2. A Type I self-dual code over F4 or over F2 of length n and minimum distance d is s-extremal if the minimum weight of its shadow is largest possible. The purpose of this paper is to give some results which are missing in a series of papers by Bachoc and Gaborit [2], by Gaborit [6], and by Bautista, et. al. [1]. In particular, we give an explicit formula for the numbers of the first four nonzero weights of an s-extremal code over F4. We improve a bound on the length for which there exists an s-extremal code over F4 (res. F2) with even minimum distance d (resp. d ≡ 0 (mod 4)), and give codes related to s-extremal binary codes.
منابع مشابه
On extremal self-dual ternary codes of length 48
The notion of an extremal self-dual code has been introduced in 1 . As Gleason 2 remarks onemay use invariance properties of the weight enumerator of a self-dual code to deduce upper bounds on the minimum distance. Extremal codes are self-dual codes that achieve these bounds. The most wanted extremal code is a binary self-dual doubly even code of length 72 and minimum distance 16. One frequentl...
متن کاملClassification of extremal and $s$-extremal binary self-dual codes of length 38
Abstract—In this paper we classify all extremal and s-extremal binary self-dual codes of length 38. There are exactly 2744 extremal [38, 19, 8] self-dual codes, two s-extremal [38, 19, 6] codes, and 1730 s-extremal [38, 19, 8] codes. We obtain our results from the use of a recursive algorithm used in the recent classification of all extremal self-dual codes of length 36, and from a generalizati...
متن کاملUpper Bounds for the length of s - Extremal Codes over F 2 , F 4 , and F 2 + u F 2
Our purpose is to find an upper bound for the length of s-extremal codes over F2 (resp. F4) when d ≡ 2 (mod 4) (resp. d odd). This question is left open in [6], [2]. More precisely, we show that there is no s-extremal binary code of length n ≥ 21d− 82 if d > 6 and d ≡ 2 (mod 4). Similarly we show that there is no s-extremal additive F4 code of length n ≥ 13d− 26 if d > 1 and d is odd. We also d...
متن کاملA bound for certain s-extremal lattices and codes
In this paper we introduce the notion of s-extremal lattice for unimodular Type I lattices. We give a bound on the existence of certain such s-extremal lattices: an s-extremal lattice of dimension n and minimal even norm μ must satisfy n < 12μ. This result implies that such lattices are also extremal and that there are a finite number of them. We also give an equivalent bound for s-extremal sel...
متن کاملNew results on s-extremal additive codes over GF(4)
The purpose of this paper is to study s-extremal additive codes over F4. The concept of s-extremality was introduced in [2] and the s-extremal additive codes with minimum distance up to 4 were classified. In this paper, our goal is to construct (or to classify if possible) new s-extremal codes with minimum distance d = 5 or 6. For d = 5 we classify the codes of length 13, and we construct 1075 ...
متن کامل